On the waiting times in queues with dependency between interarrival and service times
نویسنده
چکیده
In this paper a queueing system with partial correlation is considered. We assume that the amount of work (service time) brought in by a customer and the subsequent interarrival time are dependent. We show that in this case stronger dependence between interarrival and service times leads to decreasing waiting times in the increasing convex ordering sense. This generalizes a result of Chao (Oper. Res. Lett. 17 (1995) 47–51). c © 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
On the Waiting Time in the GI/M/1 Vacations Queues with Dependency Between Interarrival and Service Times
We derive the waiting time distribution in a GI/M/1 queueing system with dependence between the service time of each customer and the subsequent interarrival times. In addition, the server takes exponentially distributed vacations when there are no customers left to serve in the queue.
متن کاملOn queues with service and interarrival times depending on waiting times
W D = max{0, B − A + YW}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p = 0 it describes the waiting time of the server in an alternating service model. For all other values of p this model describes a FCFS queue in which the service times and interarrival times depend linearly and ...
متن کاملHeavy-traffic limits for nearly deterministic queues: stationary distributions
We establish heavy-traffic limits for stationary waiting times and other performance measures in Gn/Gn/1 queues, where Gn indicates that an original point process is modified by cyclic thinning of order n; i.e., the thinned process contains every n point from the original point process. The classical example is the Erlang En/En/1 queue, where cyclic thinning of order n is applied to both the in...
متن کاملWaiting time characteristics in cyclic queues
In this paper we study a single-server queue with FIFO service and cyclic interarrival and service times. An efficient approximative algorithm is developed for the first two moments of the waiting time. Numerical results are included to demonstrate that the algorithm yields accurate results. For the special case of exponential interarrival times we present a simple exact analysis.
متن کاملThe Marshall and Stoyan Bounds for Imrl/g/1 Queues Are Tight
Consider the G I / G / i queue partially specified by the first two moments of the interarrival times and service times. Let ?~ be the arrival rate, p the traffic intensity, c, 2 the squared coefficient of variation of the interarrival-time distribution (variance divided by the square of its mean), the c 2 the squared coefficient of variation of the service-time distribution. Kingman [!!] showe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 26 شماره
صفحات -
تاریخ انتشار 2000